Binary to RNS encoder with Modulo 2n+1 Channel in Diminished-1 Number System

نویسندگان

  • Ivan Krstic
  • Milena Petrovic
  • Vidosav Stojanovic
چکیده

Architecture of binary to residue number system encoder based on the moduli set {2 1,2 ,2 1} n n n   , and architecture of encoder with modulo 2 1 n  channel in the diminished-1 representation instead of the standard modulo 2 1 n  channel are presented. We consider the binary numbers with dynamic range of proposed moduli set which is 3 2 2 n n  . Within this dynamic range, 3n -bit binary number is partitioned into three n -bit parts and converted to standard residue numbers, or converted to two standard residues and a residue in the diminished-1 representation. Our approach enables a unified design for the moduli set adders. The proposed architecture can be utilized in conjunction with any fast binary adder without requiring any extra hardware. The encoder architecture with diminished-1 encoded channel has been mapped on an Xilinx FPGA chip.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ضرب‌کننده و ضرب‌جمع‌کننده پیمانه 2n+1 برای پردازنده سیگنال دیجیتال

Nowadays, digital signal processors (DSPs) are appropriate choices for real-time image and video processing in embedded multimedia applications not only due to their superior signal processing performance, but also of the high levels of integration and very low-power consumption. Filtering which consists of multiple addition and multiplication operations, is one of the most fundamental operatio...

متن کامل

Low-Power Radix-8 Booth Encoded Modulo 2n − 1 Multiplier with Adaptive Delay

A special moduli set Residue Number System (RNS) of high dynamic range (DR) can speed up the execution of very-large word-length repetitive multiplications found in applications like public key cryptography. The modulo 2n − 1 multiplier is usually the noncritical datapath among all modulo multipliers in such high-DR RNS multiplier. This timing slack can be exploited to reduce the system area an...

متن کامل

Power efficient Simulation of Diminished-One Modulo 2n+1 Adder Using Circular Carry Selection

In this paper we have find great applicability in RNS implementation for the Diminished-one modulo 2n+1 Adder using Circular Carry Selection (CCS) circuit. This adder presents a modulo addition of different bit values for n = 8, 12, 16, 24, 32, 48, 64. We are using the Diminished-one criteria using Circular Carry Selection (CCS) technique for the proposed modulo adder. The circuit design of pro...

متن کامل

Modulo Multiplier by using Radix-8 Modified Booth Algorithm

Modular arithmetic operations (inversion, multiplication and exponentiation) are used in several cryptography applications. RSA and elliptic curve cryptography (ECC) are two of the most well established and widely used public key cryptographic (PKC) algorithms. The encryption and decryption of these PKC algorithms are performed by repeated modulo multiplications. These multiplications differ fr...

متن کامل

DESIGN OF BOOTH ENCODED MODULO 2n-1 MULTIPLIER USING RADIX-8 WITH HIGH DYNAMIC RANGE RESIDUE NUMBER SYSTEM

A special moduli set Residue Number System (RNS) of high Dynamic Range (DR) can speed up the execution of verylarge word-length repetitive multiplications found in applications like public key cryptography. The modulo 2n-1 multiplier is usually the noncritical datapath among all modulo multipliers in such high-DR RNS multiplier. This timing slack can be exploited to reduce the system area and p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014